An On - Line Algorithm for theMac -

نویسندگان

  • Luca Forlizzi
  • Enrico Nardelli
چکیده

In this paper we introduce an eecient algorithm for the on-line computation of the MacNeille completion of a poset. Our algorithm is polynomial in the number of elements in the lattice completion and has a better worst-case complexity than previous proposals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem

In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...

متن کامل

A Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings

The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...

متن کامل

An algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis

This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...

متن کامل

A Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers

This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...

متن کامل

Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm

Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011